KOREAN CLAN ORGANIZATION

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CLAN: Closely reLated ApplicatioNs

Although popular text search engines allow users to retrieve similar web pages, source code search engines do not have this feature. Knowing similarity between applications plays an important role in improving understanding and assessing reusability of these applications, rapid prototyping, and discovering code theft and plagiarism. However, detecting similar applications is a notoriously diffi...

متن کامل

Korean to head World Health Organization.

CMAJ • APR. 29, 2003; 168 (9) 1169 Epidemiologist Jong Wook Lee, a South Korean expert on vaccines, tuberculosis and poverty-related disease, is expected to succeed Dr. Gro Harlem Brundtland as director general of the World Health Organization (WHO) in July. His nomination by the 32-member WHO Executive Board will likely be rubber-stamped by the World Health Assembly in May. The very political ...

متن کامل

Convex Games versus clan Games

In this paper we provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. We show that a “dualize and restrict”procedure transforms total clan games with zero worth for the clan into monotonic convex games. Furthermore, each monotonic convex game generates a total clan game with zero worth for the clan by a “dualize and extend” pr...

متن کامل

VIA over the CLAN Network

The Virtual Interface Architecture is an industry standard for high performance networking in system-area networks, and the same model is proposed for Infiniband. Existing implementations suffer from high complexity, and scaling to higher bandwidths and large numbers of endpoints is likely to be problematic. We present a novel implementation of VIA that consists of a thin software layer over th...

متن کامل

Popular and Clan-Popular b-Matchings

Suppose that each member of a set of agents has a preference list of a subset of houses, possibly involving ties, and each agent and house has their capacity denoting the maximum number of houses/agents (respectively) that can be matched to him/her/it. We want to find a matching M , called popular, for which there is no other matching M ′ such that more agents prefer M ′ to M than M to M ′, sub...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: American Anthropologist

سال: 1899

ISSN: 0002-7294

DOI: 10.1525/aa.1899.1.1.02a00100